Antipowers in Uniform Morphic Words and the Fibonacci Word

Fici, Restivo, Silva, and Zamboni define a $k$-antipower to be word composed of $k$ pairwise distinct, concatenated words equal length. Berger Defant conjecture that for any sufficiently well-behaved aperiodic morphic $w$, there exists constant $c$ such index $i$, with block length at most $ck$ starts the $i$th position $w$. They prove their in case binary words, we extend result alphabets arbitrary finite size characterize those which does not hold. We also specific Fibonacci word.